Bilayers merge even when exocytosis is transient
نویسندگان
چکیده
منابع مشابه
Bilayers merge even when exocytosis is transient.
During exocytosis, the lumen of secretory vesicles connects with the extracellular space. In some vesicles, this connection closes again, causing the vesicle to be recaptured mostly intact. The degree to which the bilayers of such vesicles mix with the plasma membrane is unknown. Work supporting the kiss-and-run model of transient exocytosis implies that synaptic vesicles allow neither lipid no...
متن کاملMeiosis: When Even Two Is a Crowd
Recent studies in Caenorhabditis elegans show that crossover interference, which usually limits the number of exchanges per meiotic bivalent to just 'one', requires the continuity of both homologs. One 'function' of crossover interference may be the prevention of crossover events that might not effectively hold homologs together.
متن کاملWhen every $P$-flat ideal is flat
In this paper, we study the class of rings in which every $P$-flat ideal is flat and which will be called $PFF$-rings. In particular, Von Neumann regular rings, hereditary rings, semi-hereditary ring, PID and arithmetical rings are examples of $PFF$-rings. In the context domain, this notion coincide with Pr"{u}fer domain. We provide necessary and sufficient conditions for...
متن کاملHyperovals of H(3, q2) when q is even
For even q, a group G isomorphic to PSL(2, q) stabilizes a Baer conic inside a symplectic subquadrangle W(3, q) of H(3, q2). In this paper the action of G on points and lines of H(3, q2) is investigated. A construction is given of an infinite family of hyperovals of size 2(q3−q) of H(3, q2), with each hyperoval having the property that its automorphism group contains G. Finally it is shown that...
متن کاملOn the Average Running Time of Odd-Even Merge Sort
Trus paper is concerned with the average rUDDing time of Batcher's odd-even merge sort when implemented on a collection of processors. We consider the case where n, the size of the input, is an arbitrary multiple of the number p of processors used. We show that Batcher's odd-even merge (for two sorted lists of length n each) can be implemented to run in time O«nlp)(log(2 + p2 In))) on the avera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2004
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.0401316101